Realizability as the Connection between Computable and Constructive Mathematics
نویسنده
چکیده
These are lecture notes for a tutorial seminar which I gave at a satellite seminar of “Computability and Complexity in Analysis 2004” in Kyoto. The main message of the notes is that computable mathematics is the realizability interpretation of constructive mathematics. The presentation is targeted at an audience which is familiar with computable mathematics but less so with constructive mathematics, category theory or realizability theory.
منابع مشابه
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce code interfaces for the data structure corresponding to a mathematical theory. Our tool, called RZ, serves as a bridge between the worlds of constructive mathematics and programming. By using the realizability interpret...
متن کاملFrom Constructive Mathematics to Computable Analysis via the Realizability Interpretation
Constructive mathematics is mathematics without the use of the principle of the excluded middle. There exists a wide array of models of constructive logic. One particular interpretation of constructive mathematics is the realizability interpretation. It is utilized as a metamathematical tool in order to derive admissible rules of deduction for systems of constructive logic or to demonstrate the...
متن کاملA Limiting Rst Order Realizability Interpretation
Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is equipped with a computable function giving the solution of the theorem. Limit Computable Mathematics (LCM) considered in this note is a fragment of classical mathematics in which any proof of an existence theorem is equipped with a function computing the solution of th...
متن کاملInteractive Realizability for second-order Heyting arithmetic with EM1 and SK1
We introduce a classical realizability semantics based on interactive learning for full second-order Heyting Arithmetic with excluded middle and Skolem axioms over Σ1-formulas. Realizers are written in a classical version of Girard’s System F. Since the usual computability semantics does not apply to such a system, we introduce a constructive forcing/computability semantics: though realizers ar...
متن کاملIntuitionistic Mathematics and Realizability in the Physical World
Intuitionistic mathematics perceives subtle variations in meaning where classical mathematics asserts equivalence, and permits geometrically and computationally motivated axioms that classical mathematics prohibits. It is therefore wellsuited as a logical foundation on which questions about computability in the real world are studied. The realizability interpretation explains the computational ...
متن کامل